Teleportation on a quantum dot array

We present a model of quantum teleportation protocol based on a double quantum dot array. The unknown qubit is encoded using a pair of quantum dots, coupled by tunneling, with one excess electron. It is shown how to create maximally entangled states with this kind of qubits using an adiabatically increasing Coulomb repulsion between different pairs. This entangled states are exploited to perform teleportation again using an adiabatic coupling between them and the incoming unknown state. Finally, a sudden separation of Bob's qubit enables a time evolution of Alice's state providing a modified version of standard Bell measurement. Substituting the four quantum dots entangled state with a chain of coupled DQD's, a quantum channel with high fidelity arises from this scheme allowing the transmission over long distances.Comment: 4 pages, 2 figure

A Dynamic Composition and Stubless Invocation Approach for Information-Providing Services

The automated specification and execution of composite services are important capabilities of service-oriented systems. In practice, service invocation is performed by client components (stubs) that are generated from service descriptions at design time. Several researchers have proposed mechanisms for late binding. They all require an object representation (e.g., Java classes) of the XML data types specified in service descriptions to be generated and meaningfully integrated in the client code at design time. However, the potential of dynamic composition can only be fully exploited if supported in the invocation phase by the capability of dynamically binding to services with previously unknown interfaces. In this work, we address this limitation by proposing a way of specifying and executing composite services, without resorting to previously compiled classes that represent XML data types. Semantic and structural properties encoded in service descriptions are exploited to implement a mechanism, based on the Graphplan algorithm, for the run-time specification of composite service plans. Composite services are then executed through the stubless invocation of constituent services. Stubless invocation is achieved by exploiting structural properties of service descriptions for the run-time generation of messages

Crime and Punishment: Adam Smith\u27s Theory of Sentimental Law and Economics

For Adam Smith, a crime is not the result of a rational calculation of loss and gain but the consequence of envy and a vain desire to parade wealth to attract the approbation of others, combined with a natural systematic bias in overestimating the probability of success. Similarly, Smith does not conceive of legal sanctions as a rational deterrent but as deriving from the feeling of resentment. While the prevailing approach of the eighteenth century is a rational explanation of crime and a utilitarian use of punishment, Adam Smith instead builds his theory of criminal behavior and legal prosecution consistently on the sentiments. A well-functioning legal system is thus an unintended consequence of our desire to bring justice to the individual person, not the result of a rational calculation to promote the public good, just like a well-functioning economic system is the unintended consequence of our desire to better our own condition, not the result of a rational calculation to promote public good

A Resource-based Rule Engine for energy savings recommendations in Educational Buildings

Raising awareness among young people on the relevance of behaviour change for achieving energy savings is widely considered as a key approach towards long-term and cost-effective energy efficiency policies. The GAIA Project aims to deliver a comprehensive solution for both increasing awareness on energy efficiency and achieving energy savings in school buildings. In this framework, we present a novel rule engine that, leveraging a resource-based graph model encoding relevant application domain knowledge, accesses IoT data for producing energy savings recommendations. The engine supports configurability, extensibility and ease-of-use requirements, to be easily applied and customized to different buildings. The paper introduces the main design and implementation details and presents a set of preliminary performance results

Virtual Functions Placement with Time Constraints in Fog Computing: a Matching Theory Perspective

This paper proposes two virtual function (VFs) placement approaches in a Fog domain. The considered solutions formulate a matching game with externalities, aiming at minimizing both the worst application completion time and the number of applications in outage, i.e., the number of applications with an overall completion time greater than a given deadline. The first proposed matching game is established between the VFs set and the Fog Nodes (FNs) set by taking into account the ordered sequence of services (i.e., chain) requested by each application. Conversely, the second proposed method overlooks the applications service chain structure in formulating the VF placement problem, with the aim at lowering the computation complexity without loosing the performance. Furthermore, in order to complete our analysis, the stability of the reached matchings has been theoretically proved for both the proposed solutions. Finally, performance comparisons of the proposed MT approaches with different alternatives are provided to highlight the superior performance of the proposed methods